Multiplicative Consistency Ascertaining, Inconsistency Repairing, and Weights Derivation of Hesitant Multiplicative Preference Relations

This article investigates multiplicative consistency ascertaining, inconsistency repairing, and weights derivation for hesitant preference relations (HMPRs). First, the completely weakly of HMPRs are defined. Based on them, 0–1 mixed programming models simple algebraic operations proposed to ascertain HMPRs. Then, some goal developed generate from consistent revise inconsistent An integrated procedure manage consistencies is designed. The methods also extended accommodate incomplete HMPRs, estimate missing values. Finally, numerical examples, a comparative analysis with existent approaches, simulation included illustrate practicality effectiveness models.